Classes of discrete optimization problems and their decision problems
نویسندگان
چکیده
منابع مشابه
Discrete Decision Problems, Multiple Criteria Optimization Classes and Lexicographic Max-ordering
The topic of this paper are discrete decision problems with multiple criteria. We rst deene discrete multiple criteria decision problems and introduce a classiication scheme for multiple criteria optimization problems. To do so we use multiple criteria optimization classes. The main result is a characterization of the class of lexicographic max-ordering problems by two very useful properties, r...
متن کاملDiscrete Bilevel Optimization Problems
Bilevel programming problems are hierarchical optimization problems in which the feasible set is determined by the set of optimal solutions of a second, parametric optimization problem. In this paper we consider problems where this second problem is a discrete one. We start with addressing the problem of the existence of optimal solutions. Then, an algorithm is proposed solving these problems. ...
متن کاملproblems and strategies of translating persian lexical collocations into english: the case of noun-verb and noun-adjective collocations
در محیط های دانشگاهی ایران ، آموزش ترجمه واژگان هم آیند که به منزله امری لاینفک برای دانش جویان رشته مترجمی زبان می باشد، تا حدود زیادی نادیده گرفته شده است . این واقعیت باعث شده است تا دانش جویان رشته مترجمی زبان در ترجمه ی واژگان هم آیند اشتباهات بسیاری مرتکب شوند. این پژوهش توجه ویژه ای به ترجمه واژگان هم آیند داشته است. برای مشخص نمودن مشکلات و استراتژی های مورد استفاده ی دانش جویان در ترجم...
15 صفحه اولApproximation Classes for Real Number Optimization Problems
A fundamental research area in relation with analyzing the complexity of optimization problems are approximation algorithms. For combinatorial optimization a vast theory of approximation algorithms has been developed, see [1]. Many natural optimization problems involve real numbers and thus an uncountable search space of feasible solutions. A uniform complexity theory for real number decision p...
متن کاملContinuous Reformulations of Discrete-Continuous Optimization Problems
This paper treats the solution of nonlinear optimization problems involving discrete decision variables, also known as generalized disjunctive programming (GDP) or mixed-integer nonlinear programming (MINLP) problems, that arise in process engineering. The key idea is to eliminate the discrete decision variables by adding a set of continuous variables and constraints that represent the discrete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1974
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(74)80024-3